Fault tolerant network constructors

We consider adversarial crash faults of nodes in the network constructors model [Michail and Spirakis, 2016]. first show that, without further assumptions, class graph languages that can be (stably) constructed under is non-empty but small. On positive side, linear waste enables construction, on a fraction nodes, any language constructible fault-free case partial constructibility allows us to construct large languages. then extend original with minimal form fault notifications. Our main result fault-tolerant universal constructor. Finally, we logarithmic local memories exploited for no-waste simulation